YES 1.671
↳ HASKELL
↳ CR
((elemFM :: Char -> FiniteMap Char a -> Bool) :: Char -> FiniteMap Char a -> Bool) |
import qualified Maybe import qualified Prelude |
||||||||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
||||||||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
||||||||||||||||||||||||
elemFM :: Ord b => b -> FiniteMap b a -> Bool
|
||||||||||||||||||||||||
lookupFM :: Ord b => FiniteMap b a -> b -> Maybe a
|
import qualified FiniteMap import qualified Prelude |
case lookupFM fm key of Nothing → False Just elt → True
elemFM0 Nothing = False elemFM0 (Just elt) = True
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
((elemFM :: Char -> FiniteMap Char a -> Bool) :: Char -> FiniteMap Char a -> Bool) |
import qualified Maybe import qualified Prelude |
||||||||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
||||||||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
||||||||||||||||||||||||
elemFM :: Ord a => a -> FiniteMap a b -> Bool
|
||||||||||||||||||||||||
|
||||||||||||||||||||||||
lookupFM :: Ord a => FiniteMap a b -> a -> Maybe b
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((elemFM :: Char -> FiniteMap Char a -> Bool) :: Char -> FiniteMap Char a -> Bool) |
import qualified Maybe import qualified Prelude |
||||||||||||||||||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
||||||||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
||||||||||||||||||||||||
elemFM :: Ord a => a -> FiniteMap a b -> Bool
|
||||||||||||||||||||||||
|
||||||||||||||||||||||||
lookupFM :: Ord b => FiniteMap b a -> b -> Maybe a
|
import qualified FiniteMap import qualified Prelude |
lookupFM EmptyFM key = Nothing lookupFM (Branch key elt vw fm_l fm_r) key_to_find
| key_to_find < key
= lookupFM fm_l key_to_find | key_to_find > key
= lookupFM fm_r key_to_find | otherwise
= Just elt
lookupFM EmptyFM key = lookupFM4 EmptyFM key lookupFM (Branch key elt vw fm_l fm_r) key_to_find = lookupFM3 (Branch key elt vw fm_l fm_r) key_to_find
lookupFM2 key elt vw fm_l fm_r key_to_find True = lookupFM fm_l key_to_find lookupFM2 key elt vw fm_l fm_r key_to_find False = lookupFM1 key elt vw fm_l fm_r key_to_find (key_to_find > key)
lookupFM0 key elt vw fm_l fm_r key_to_find True = Just elt
lookupFM1 key elt vw fm_l fm_r key_to_find True = lookupFM fm_r key_to_find lookupFM1 key elt vw fm_l fm_r key_to_find False = lookupFM0 key elt vw fm_l fm_r key_to_find otherwise
lookupFM3 (Branch key elt vw fm_l fm_r) key_to_find = lookupFM2 key elt vw fm_l fm_r key_to_find (key_to_find < key)
lookupFM4 EmptyFM key = Nothing lookupFM4 wv ww = lookupFM3 wv ww
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
(elemFM :: Char -> FiniteMap Char a -> Bool) |
import qualified Maybe import qualified Prelude |
|||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
|||||||||
elemFM :: Ord b => b -> FiniteMap b a -> Bool
|
|||||||||
|
|||||||||
lookupFM :: Ord a => FiniteMap a b -> a -> Maybe b
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ QDP
↳ DependencyGraphProof
new_elemFM01(Branch(Char(Succ(wx4000)), wx41, wx42, wx43, wx44), Char(Zero), bb) → new_elemFM01(wx43, Char(Zero), bb)
new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, Zero, Succ(wx330), h) → new_elemFM01(wx29, Char(Succ(wx31)), h)
new_elemFM00(wx73, wx74, wx75, wx76, wx77, wx78, Succ(wx790), Zero, ba) → new_elemFM01(wx77, Char(Succ(wx78)), ba)
new_elemFM02(wx26, wx27, wx28, wx29, wx30, wx31, h) → new_elemFM00(wx26, wx27, wx28, wx29, wx30, wx31, Succ(wx31), Succ(wx26), h)
new_elemFM00(wx73, wx74, wx75, wx76, wx77, wx78, Succ(wx790), Succ(wx800), ba) → new_elemFM00(wx73, wx74, wx75, wx76, wx77, wx78, wx790, wx800, ba)
new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, Zero, Zero, h) → new_elemFM02(wx26, wx27, wx28, wx29, wx30, wx31, h)
new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, Succ(wx320), Zero, h) → new_elemFM00(wx26, wx27, wx28, wx29, wx30, wx31, Succ(wx31), Succ(wx26), h)
new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, Succ(wx320), Succ(wx330), h) → new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, wx320, wx330, h)
new_elemFM01(Branch(Char(Zero), wx41, wx42, wx43, wx44), Char(Succ(wx300)), bb) → new_elemFM01(wx44, Char(Succ(wx300)), bb)
new_elemFM01(Branch(Char(Succ(wx4000)), wx41, wx42, wx43, wx44), Char(Succ(wx300)), bb) → new_elemFM0(wx4000, wx41, wx42, wx43, wx44, wx300, wx300, wx4000, bb)
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
new_elemFM00(wx73, wx74, wx75, wx76, wx77, wx78, Succ(wx790), Zero, ba) → new_elemFM01(wx77, Char(Succ(wx78)), ba)
new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, Zero, Succ(wx330), h) → new_elemFM01(wx29, Char(Succ(wx31)), h)
new_elemFM02(wx26, wx27, wx28, wx29, wx30, wx31, h) → new_elemFM00(wx26, wx27, wx28, wx29, wx30, wx31, Succ(wx31), Succ(wx26), h)
new_elemFM00(wx73, wx74, wx75, wx76, wx77, wx78, Succ(wx790), Succ(wx800), ba) → new_elemFM00(wx73, wx74, wx75, wx76, wx77, wx78, wx790, wx800, ba)
new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, Zero, Zero, h) → new_elemFM02(wx26, wx27, wx28, wx29, wx30, wx31, h)
new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, Succ(wx320), Zero, h) → new_elemFM00(wx26, wx27, wx28, wx29, wx30, wx31, Succ(wx31), Succ(wx26), h)
new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, Succ(wx320), Succ(wx330), h) → new_elemFM0(wx26, wx27, wx28, wx29, wx30, wx31, wx320, wx330, h)
new_elemFM01(Branch(Char(Zero), wx41, wx42, wx43, wx44), Char(Succ(wx300)), bb) → new_elemFM01(wx44, Char(Succ(wx300)), bb)
new_elemFM01(Branch(Char(Succ(wx4000)), wx41, wx42, wx43, wx44), Char(Succ(wx300)), bb) → new_elemFM0(wx4000, wx41, wx42, wx43, wx44, wx300, wx300, wx4000, bb)
From the DPs we obtained the following set of size-change graphs:
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
new_elemFM01(Branch(Char(Succ(wx4000)), wx41, wx42, wx43, wx44), Char(Zero), bb) → new_elemFM01(wx43, Char(Zero), bb)
From the DPs we obtained the following set of size-change graphs: